Anonymous rating structure for database

ABSTRACT

An example operation may include one or more of receiving, from an executing client, a blockchain transaction comprising an anonymous rating related to an authorizing client, a merkle tree root node value, a proof, and a nullifier, and in response, executing, by a smart contract, a valid historical value assert call on a lookback key storing the merkle tree root node value, verifying, through a valid historical value assert call, that the merkle tree root node value is a current or previous value of the merkle tree root node value, verifying the proof with the merkle tree root node value and the nullifier, adding the anonymous rating to a shared ledger, marking the nullifier as used, and storing the marked nullifier to the shared ledger.

TECHNICAL FIELD

This application generally relates to updating supplier ratings anonymously, and more particularly, to an anonymous rating structure for a database.

BACKGROUND

A centralized database stores and maintains data in a single database (e.g., a database server) at one location. This location is often a central computer, for example, a desktop central processing unit (CPU), a server CPU, or a mainframe computer. Information stored on a centralized database is typically accessible from multiple different points. Multiple users or client workstations can work simultaneously on the centralized database, for example, based on a client/server configuration. A centralized database is easy to manage, maintain, and control, especially for purposes of security because of its single location. Within a centralized database, data redundancy is minimized as a single storing place of all data also implies that a given set of data only has one primary record.

However, a centralized database suffers from significant drawbacks. For example, a centralized database has a single point of failure. In particular, if there are no fault-tolerance considerations and a hardware failure occurs (for example a hardware, firmware, and/or a software failure), all data within the database is lost and work of all users is interrupted. In addition, centralized databases are highly dependent on network connectivity. As a result, the slower the connection, the amount of time needed for each database access is increased. Another drawback is the occurrence of bottlenecks when a centralized database experiences high traffic due to a single location. Furthermore, a centralized database provides limited access to data because only one copy of the data is maintained by the database. As a result, multiple devices cannot access the same piece of data at the same time without creating significant problems or risk overwriting stored data. Furthermore, because a database storage system has minimal to no data redundancy, data that is unexpectedly lost is very difficult to retrieve other than through manual operation from back-up storage. As such, what is needed is a solution that overcomes these drawbacks and limitations.

SUMMARY

One example embodiment provides a system that includes an executing client, configured to perform one or more of generate a blockchain transaction comprising an anonymous rating related to an authorizing client and a root node value, a blockchain network, comprising a shared ledger, comprising one or more of a lookback key, and a merkle tree that corresponds to a supplier, the merkle tree comprising a merkle tree root node value stored in the lookback key, and a byte-wise prefix search tree of a fixed depth, configured to store valid historical values for the lookback key and a smart contract, configured to perform one or more of receive the blockchain transaction, add the anonymous rating to the shared ledger.

Another example embodiment provides a method that includes one or more of receiving, from an executing client, a blockchain transaction comprising an anonymous rating related to an authorizing client, a merkle tree root node value, a proof, and a nullifier, and in response, executing, by a smart contract, a valid historical value assert call on a lookback key storing the merkle tree root node value, verifying, through a valid historical value assert call, that the merkle tree root node value is a current or previous value of the merkle tree root node value, verifying the proof with the merkle tree root node value and the nullifier, adding the anonymous rating to a shared ledger, marking the nullifier as used, and storing the marked nullifier to the shared ledger.

A further example embodiment provides a non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform one or more of receiving, from an executing client, a blockchain transaction comprising an anonymous rating related to an authorizing client, a merkle tree root node value, a proof, and a nullifier, and in response, executing, by a smart contract, a valid historical value assert call on a lookback key storing the merkle tree root node value, verifying, through a valid historical value assert call, that the merkle tree root node value is a current or previous value of the merkle tree root node value, verifying the proof with the merkle tree root node value and the nullifier, adding the anonymous rating to a shared ledger, marking the nullifier as used, and storing the marked nullifier to the shared ledger.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A illustrates a system for processing anonymous transactions in a blockchain, according to example embodiments.

FIG. 1B illustrates anonymous transaction request content in a blockchain, according to example embodiments.

FIG. 2A illustrates an example blockchain architecture configuration, according to example embodiments.

FIG. 2B illustrates a blockchain transactional flow, according to example embodiments.

FIG. 3A illustrates a permissioned network, according to example embodiments.

FIG. 3B illustrates another permissioned network, according to example embodiments.

FIG. 3C illustrates a permissionless network, according to example embodiments.

FIG. 4 illustrates a system messaging diagram for processing anonymous transactions in a blockchain, according to example embodiments.

FIG. 5A illustrates a flow diagram for updating an anonymous rating in a blockchain, according to example embodiments.

FIG. 5B illustrates a flow diagram for lookback key verification in a blockchain, according to example embodiments.

FIG. 5C illustrates a flow diagram of an example method of granting access based on user rating, according to example embodiments.

FIG. 6A illustrates an example system configured to perform one or more operations described herein, according to example embodiments.

FIG. 6B illustrates another example system configured to perform one or more operations described herein, according to example embodiments.

FIG. 6C illustrates a further example system configured to utilize a smart contract, according to example embodiments.

FIG. 6D illustrates yet another example system configured to utilize a blockchain, according to example embodiments.

FIG. 7A illustrates a process for a new block being added to a distributed ledger, according to example embodiments.

FIG. 7B illustrates contents of a new data block, according to example embodiments.

FIG. 7C illustrates a blockchain for digital content, according to example embodiments.

FIG. 7D illustrates a block which may represent the structure of blocks in the blockchain, according to example embodiments.

FIG. 8A illustrates an example blockchain which stores machine learning (artificial intelligence) data, according to example embodiments.

FIG. 8B illustrates an example quantum-secure blockchain, according to example embodiments.

FIG. 9 illustrates an example system that supports one or more of the example embodiments.

DETAILED DESCRIPTION

It will be readily understood that the instant components, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of at least one of a method, apparatus, non-transitory computer readable medium and system, as represented in the attached figures, is not intended to limit the scope of the application as claimed but is merely representative of selected embodiments.

The instant features, structures, or characteristics as described throughout this specification may be combined or removed in any suitable manner in one or more embodiments. For example, the usage of the phrases “example embodiments”, “some embodiments”, or other similar language, throughout this specification refers to the fact that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment. Thus, appearances of the phrases “example embodiments”, “in some embodiments”, “in other embodiments”, or other similar language, throughout this specification do not necessarily all refer to the same group of embodiments, and the described features, structures, or characteristics may be combined or removed in any suitable manner in one or more embodiments. Further, in the diagrams, any connection between elements can permit one-way and/or two-way communication even if the depicted connection is a one-way or two-way arrow. Also, any device depicted in the drawings can be a different device. For example, if a mobile device is shown sending information, a wired device could also be used to send the information.

In addition, while the term “message” may have been used in the description of embodiments, the application may be applied to many types of networks and data. Furthermore, while certain types of connections, messages, and signaling may be depicted in exemplary embodiments, the application is not limited to a certain type of connection, message, and signaling.

Example embodiments provide methods, systems, components, non-transitory computer readable media, devices, and/or networks, which provide an anonymous rating structure for a database.

In one embodiment the application utilizes a decentralized database (such as a blockchain) that is a distributed storage system, which includes multiple nodes that communicate with each other. The decentralized database includes an append-only immutable data structure resembling a distributed ledger capable of maintaining records between mutually untrusted parties. The untrusted parties are referred to herein as peers or peer nodes. Each peer maintains a copy of the database records and no single peer can modify the database records without a consensus being reached among the distributed peers. For example, the peers may execute a consensus protocol to validate blockchain storage transactions, group the storage transactions into blocks, and build a hash chain over the blocks. This process forms the ledger by ordering the storage transactions, as is necessary, for consistency. In various embodiments, a permissioned and/or a permissionless blockchain can be used. In a public or permission-less blockchain, anyone can participate without a specific identity. Public blockchains can involve native cryptocurrency and use consensus based on various protocols such as Proof of Work (PoW). On the other hand, a permissioned blockchain database provides secure interactions among a group of entities which share a common goal but which do not fully trust one another, such as businesses that exchange funds, goods, information, and the like.

This application can utilize a blockchain that operates arbitrary, programmable logic, tailored to a decentralized storage scheme and referred to as “smart contracts” or “chaincodes.” In some cases, specialized chaincodes may exist for management functions and parameters which are referred to as system chaincode. The application can further utilize smart contracts that are trusted distributed applications which leverage tamper-proof properties of the blockchain database and an underlying agreement between nodes, which is referred to as an endorsement or endorsement policy. Blockchain transactions associated with this application can be “endorsed” before being committed to the blockchain while transactions, which are not endorsed, are disregarded. An endorsement policy allows chaincode to specify endorsers for a transaction in the form of a set of peer nodes that are necessary for endorsement. When a client sends the transaction to the peers specified in the endorsement policy, the transaction is executed to validate the transaction. After validation, the transactions enter an ordering phase in which a consensus protocol is used to produce an ordered sequence of endorsed transactions grouped into blocks.

This application can utilize nodes that are the communication entities of the blockchain system. A “node” may perform a logical function in the sense that multiple nodes of different types can run on the same physical server. Nodes are grouped in trust domains and are associated with logical entities that control them in various ways. Nodes may include different types, such as a client or submitting-client node which submits a transaction-invocation to an endorser (e.g., peer), and broadcasts transaction-proposals to an ordering service (e.g., ordering node). Another type of node is a peer node which can receive client submitted transactions, commit the transactions and maintain a state and a copy of the ledger of blockchain transactions. Peers can also have the role of an endorser, although it is not a requirement. An ordering-service-node or orderer is a node running the communication service for all nodes, and which implements a delivery guarantee, such as a broadcast to each of the peer nodes in the system when committing transactions and modifying a world state of the blockchain, which is another name for the initial blockchain transaction which normally includes control and setup information.

This application can utilize a ledger that is a sequenced, tamper-resistant record of all state transitions of a blockchain. State transitions may result from chaincode invocations (i.e., transactions) submitted by participating parties (e.g., client nodes, ordering nodes, endorser nodes, peer nodes, etc.). Each participating party (such as a peer node) can maintain a copy of the ledger. A transaction may result in a set of asset key-value pairs being committed to the ledger as one or more operands, such as creates, updates, deletes, and the like. The ledger includes a blockchain (also referred to as a chain) which is used to store an immutable, sequenced record in blocks. The ledger also includes a state database which maintains a current state of the blockchain.

This application can utilize a chain that is a transaction log which is structured as hash-linked blocks, and each block contains a sequence of N transactions where N is equal to or greater than one. The block header includes a hash of the block's transactions, as well as a hash of the prior block's header. In this way, all transactions on the ledger may be sequenced and cryptographically linked together. Accordingly, it is not possible to tamper with the ledger data without breaking the hash links. A hash of a most recently added blockchain block represents every transaction on the chain that has come before it, making it possible to ensure that all peer nodes are in a consistent and trusted state. The chain may be stored on a peer node file system (i.e., local, attached storage, cloud, etc.), efficiently supporting the append-only nature of the blockchain workload.

The current state of the immutable ledger represents the latest values for all keys that are included in the chain transaction log. Since the current state represents the latest key values known to a channel, it is sometimes referred to as a world state. Chaincode invocations execute transactions against the current state data of the ledger. To make these chaincode interactions efficient, the latest values of the keys may be stored in a state database. The state database may be simply an indexed view into the chain's transaction log, it can therefore be regenerated from the chain at any time. The state database may automatically be recovered (or generated if needed) upon peer node startup, and before transactions are accepted.

The present application provides a zero-knowledge proof-based method for anonymous transactions on blockchains, using valid-historical-value (VHV) assertions on specific lookback-keys for proof verification. It also provides a system for valid-historical-value (VHV) assertion efficiently implemented on blockchain nodes or peers by prefix search trees using the specified lengths of lookback-keys.

The disclosed system needs to provide authorized ratings, maintain buyer anonymity, and be verifiable. A buyer should be able to submit only one rating per business transaction (not to be confused with a smart contract blockchain transaction) he has made with the supplier. This is guaranteed by the supplier providing a one-time use token for every business transaction (e.g. successful delivery of goods). The buyer should be able to give the rating in anonymous manner (i.e. when a buyer submits the rating as part of a smart contract transaction, so that the rating is added to a shared ledger) The information in the smart contract transaction does not allow anyone to infer the identity of the buyer. The blockchain network should be able to verify that the current rating being given is for a valid business transaction for which the rating has not being given so far but it should not know which buyer is providing the current rating.

In one embodiment, benefits of the instant solutions described and depicted herein include preserving anonymity of buyers for any rating associated with a purchase of goods and services and immutability of verified ratings within shared ledgers of blockchain networks. In other embodiments, anonymity and verifiability may be preserved for other types of transactions.

The present application provides systems and methods for providing anonymous transactions to blockchains and a system enhancement to implement the same efficiently. The method involves smart contracts and trusted peers which can be made available on blockchain networks, rather than with a traditional database. The system enhancement also is specific to a smart contract application programming interface (API), and may not be relevant for a database application.

The system enhancement of the present application enables an efficient valid historical value check without iterating through a chain of transaction blocks. It proposes the specification of lookback keys with a fixed length of values it can accept in the shared ledger, and the smart contract API natively maintains a byte-wise prefix search tree in the shared ledger for each lookback key, storing all its current/previous values. This enables a valid-historical-value (VHV) call with a lookback key and a value as arguments which leverage the prefix search tree to check whether the value is a current/previous value of the lookback key. This can be done within a fixed number of operations since prefix search tee depth is at most the specified fixed length of the lookback key values, rather than iterating through the transaction blocks. By allowing the lookback key to not be included in the read-set for this operation, the VHV-call is implemented as an assert statement which passes if the value is present in the prefix search tree and exits the smart contract with failure if it does not. Thus, the enhancement provides an efficient implementation of the VHV-call in terms of operations required and avoids including it in the read-set of the transaction.

The present application provides blockchain-based solutions for anonymous ratings provided to blockchain networks. For examine, a supplier may have business transactions with one or more buyers, to whom goods or a service is supplied. For each order of goods or service supplied to a buyer, the supplier receives a rating (for example, a numerical value within a predetermined range) from the buyer. It is desirable that the specific rating value given by a buyer to a supplier is unknown. In other words, legitimate buyers should provide their ratings anonymously. Ratings received by the supplier can be publicly accessible to the business network for analytics purposes. Typically, proof generation takes ˜10-100 seconds, depending on the depth of a merkle tree (ref. LibSnarks library). A problem may arise whereby the root value could change due to addition of new leaf nodes by other raters (buyer clients) between the query for proof generation and the proof verification. This naturally occurs in NIZKP situations, when using shared data for proof generation and verification.

For a supplier, a smart contract may maintains a merkle tree whose leaf nodes represent a one-time spendable coin or token to add a supplier rating. Assume that NIZKP setup has generated proving and verification keys. NIZKP is an acronym for non-interactive zero knowledge proof. This is a protocol for creating and verifying a proof for the truth of mathematical statements without revealing any additional information. For example, this can be used to prove that there exists a solution to some equation without revealing the solution itself. The protocol is non-interactive since the prover creates the proof and communicates it to the verifier who can then verify it without any further communication to/from the prover. The NIZKP setup is an initialization (one-time) procedure for creating proving and verifying keys which are used by the prover and verifier respectively in the protocol. In a first simple approach, a history of a root node key may be used. The buyer client queries for the root node version used for proof generation, and submits this version to the smart contract to be used for proof verification. This approach has the drawback of being inherently inefficient since the version query must iterate through the versions to reach the desired version number.

In a second simple approach, at the smart contract level, each new value of the root node may be stored as a new key itself. This approach has the drawback of greatly increasing the number of keys used in the smart contract, which increases the size of the smart contract. Database lookup for changing keys may be inefficient, and caching will not help.

FIG. 1A illustrates a block diagram of a system for processing anonymous transactions in a blockchain, according to example embodiments. Referring to FIG. 1A, the system 100 includes an authorizing client 104, an executing client 108, a trusted blockchain node or peer 112, a shared ledger 116, and a smart contract or chaincode 132. The shared contract 116 includes a merkle tree corresponding to the authorizing client 120, lookback keys and values 124, and a byte-wise prefix search tree 128. The smart contract or chaincode 132 includes a valid historical value (VHV) assert call 136. A merkle tree 120 is a binary tree where each node has at most two child nodes. Sibling nodes are those which share the parent node (i.e. they are the child nodes of the same parent node). The nodes which are siblings of the nodes on the path from a leaf to the root node constitute an authentication path.

The authorizing client 104 provides a one-time token or certificate 140 to the executing client 108. The one-time token or certificate 140 allows the executing client 108 to anonymously provide a rating or numerical score related to the authorizing client 104. In one embodiment, the executing client 108 is a buyer of goods or services 144 from a supplier (authorizing client 104), and the rating or numerical score is related to buyer satisfaction for the goods or services 144 provided. In other embodiments, goods and services 144 are not provided, and the rating or numerical score applies to a different aspect of interaction that is desirable to be kept anonymous yet verifiable.

A system 100 may have one or more authorizing clients 104 and executing clients 108. In the embodiment of suppliers and buyers, one may therefore visualize multiple suppliers, and possibly multiple buyers per supplier. Each supplier (authorizing client 104) has a corresponding merkle tree 120 stored in the shared ledger 116.

In the illustrated embodiment, the executing client 108 is not a node or peer on the blockchain network, and therefore may not generate transactions directly to the blockchain network. The executing client 108 submits requests to a trusted blockchain node or peer 112, which receives the requests and responsively generates blockchain transactions 156 to the blockchain network to process, execute, and store. The embodiments use non-interactive zero knowledge proofs with (i) the executing client 108 generating the proof, and (ii) the smart contract (chaincode) 132 verifying the proof against a shared ledger's data 116. This provides semantic (smart contract logic)-level maintenance of an anonymous executing client's 108 identity. Herein it is assumes that transaction and network-level anonymity are respectively provided by the blockchain (e.g. using an identity mixer), and a trusted peer/orderer 112 for the executing client 108. An identity mixer is a mechanism proposed to be made available on Hyperledger Fabric which allows the anonymity of clients 108 submitting smart contract transactions (i.e. execution calls for the smart contract 116 with a certain payload). For example, an executing client 108 may submit a signed transaction to peer(s) on a Hyperledger Fabric blockchain, and the signature may be verified as being from a legitimate client 108 without revealing the identity of the client/signer (e.g., buyer) 108.

The process ensures that the rating provided by an executing client 108 to an authorizing client 104 cannot be linked to the latter's identity. The executing client 108 provides the smart contract or chaincode 132 a rating, a nullifier, and a zero-knowledge proof that the nullifier corresponds to a particular but undisclosed leaf in the merkle tree 120. The smart contract or chaincode 116 verifies the proof using the provided nullifier and the root node value of the merkle tree 120 stored in the shared ledger 116. Further, the smart contract or chaincode 132 verifies that the nullifier is not previously used. If these checks pass, then the rating is added to the shared ledger 116 data, and the nullifier is stored on the ledger and marked as “used”. Since the proof does not reveal which particular leaf node of the merkle tree 120 was used, the identity of the executing client 108 is protected. This protection of identity is at the level of the smart contract or chaincode 132 logic.

The disclosed approach leverages several observations. First, given a merkle tree root node value used for proof generation, the verification process in the smart contract or chaincode 132 needs to check if this is a valid previous or current root node value of the authorizing client merkle tree 120. Second, the root node value is the output of a fixed hash function, so its size is fixed (i.e. 32 bytes for SHA-256).

Some disclosed embodiments enhance a smart contract 132 API framework to support special lookback keys 124 for which an efficient valid historical value (VHV) call 136 may be natively implemented. The lookback keys and values 124 are maintained in the shared ledger 116. A byte-wise prefix search tree 128 for all the current and previous values of the lookback key is also maintained in the shared ledger 116, and is updated when the value of the lookback key 124 is updated. The byte-wise prefix search tree 128 is used for the valid historical value assert call 136. The VHV 136 is an assert statement, and the smart contract or chaincode 132 exits with an error upon failure. The assert statement in general executes a hard check in the program, for example whether two variables are equal, and exits the program with an error if the check fails.

In the proposed embodiment, the valid historical value (VHV) call is implemented as an assert statement 136 so that the lookback key 124—for which it is to be checked whether a given value is a historical value—is not required to be included in the read set of the endorsed transaction. This is because if the check succeeds then any transactions 156 committed before the current one is committed do not alter the fact that the given value was indeed a historical value for the lookback key 124. On the other hand, since the lookback key 124 is not included in the read set, if the check fails then any inconsistent update of the shared ledger 116 may be avoided because the smart contract or chaincode 132 execution exits with an error due the assert statement 136 failure and the transaction 156 is not endorsed. At a basic level, the use of an assert statement 136 avoids inconsistencies arising from the delay between a transaction endorsement (execution and read/write set creation) and commitment onto the shared ledger 116 (key-value changes as per the write set), and other transactions 156 could be committed between a transaction's endorsement and commitment. The smart contract or chaincode 132 specifies a lookback key before its first use, along with a fixed length in bytes of its possible values 124.

The smart contract API ensures that any value taken by a lookback key 124 is either null or of length exactly as specified. The fixed length value specification is leveraged to implement efficient VHV-assert 136 for lookback keys 124. Since the VHV call is an assertion 136, the lookback key 124 is not included in the read-set for the merkle tree 120. In the verification step, the executing client 108 sends the root node value 172 used for proof generation to the smart contract or chaincode 132, which checks if this is a valid previous or current value of the root node.

The Blockchain platform (e.g. Hyperledger Fabric) implements for each lookback key 124 the byte-wise prefix search tree 128 for the historical values of the key. Only the paths corresponding to valid historical values would exist in the tree 128. The depth of the tree 128 would be fixed by the length specification of the lookback key 124. This leads to efficient VHV-assert execution with a fixed number of operations. The prefix trees 128 are maintained by the blockchain nodes or peers and may not be part of the shared ledger 116 accessible directly by the smart contract or chaincode 132. The byte-wise prefix search tree 128 is updated at the time of commitment of any transaction 156 which modifies the value of the corresponding lookback key 124.

When using the proposed system enhancement of lookback keys 124, the root value of the merkle-tree 120 is stored in a lookback key 124. The above process changes slightly—the executing client 108 may also provide a root node value 172 which was used by the executing client 108 to generate the zero-knowledge proof. This value 172 may also be sent to the smart contract or chaincode 132, which additionally verifies that this is a valid historical value of the merkle-tree root value using the valid-historical-value (VHV) assert call 136. The zero-knowledge proof is verified by the smart contract or chaincode 132 with respect to the root node value 172 provided by the executing client 108.

FIG. 1B illustrates anonymous transaction request content in a blockchain, according to example embodiments. Referring to FIG. 1B, the anonymous transaction request 152 includes an anonymous rating 160, a proof 164, a nullifier 168, and a root node value 172 for a corresponding merkle tree 120. The anonymous rating 160, proof 164, nullifier 168, and root node value 172 interact as previously described and additionally as described with respect to FIGS. 4, 5A, and 5B.

FIG. 2A illustrates a blockchain architecture configuration 200, according to example embodiments. Referring to FIG. 2A, the blockchain architecture 200 may include certain blockchain elements, for example, a group of blockchain nodes 202. The blockchain nodes 202 may include one or more nodes 204-210 (these four nodes are depicted by example only). These nodes participate in a number of activities, such as blockchain transaction addition and validation process (consensus). One or more of the blockchain nodes 204-210 may endorse transactions based on endorsement policy and may provide an ordering service for all blockchain nodes in the architecture 200. A blockchain node may initiate a blockchain authentication and seek to write to a blockchain immutable ledger stored in blockchain layer 216, a copy of which may also be stored on the underpinning physical infrastructure 214. The blockchain configuration may include one or more applications 224 which are linked to application programming interfaces (APIs) 222 to access and execute stored program/application code 220 (e.g., chaincode, smart contracts, etc.) which can be created according to a customized configuration sought by participants and can maintain their own state, control their own assets, and receive external information. This can be deployed as a transaction and installed, via appending to the distributed ledger, on all blockchain nodes 204-210.

The blockchain base or platform 212 may include various layers of blockchain data, services (e.g., cryptographic trust services, virtual execution environment, etc.), and underpinning physical computer infrastructure that may be used to receive and store new transactions and provide access to auditors which are seeking to access data entries. The blockchain layer 216 may expose an interface that provides access to the virtual execution environment necessary to process the program code and engage the physical infrastructure 214. Cryptographic trust services 218 may be used to verify transactions such as asset exchange transactions and keep information private.

The blockchain architecture configuration of FIG. 2A may process and execute program/application code 220 via one or more interfaces exposed, and services provided, by blockchain platform 212. The code 220 may control blockchain assets. For example, the code 220 can store and transfer data, and may be executed by nodes 204-210 in the form of a smart contract and associated chaincode with conditions or other code elements subject to its execution. As a non-limiting example, smart contracts may be created to execute reminders, updates, and/or other notifications subject to the changes, updates, etc. The smart contracts can themselves be used to identify rules associated with authorization and access requirements and usage of the ledger. For example, the information 226 may include a one-time token or certificate, and may be processed by one or more processing entities (e.g., virtual machines) included in the blockchain layer 216. The result 228 may include a transaction to provide an anonymous rating, which is then stored to a shared ledger of the blockchain network. The physical infrastructure 214 may be utilized to retrieve any of the data or information described herein.

A smart contract may be created via a high-level application and programming language, and then written to a block in the blockchain. The smart contract may include executable code which is registered, stored, and/or replicated with a blockchain (e.g., distributed network of blockchain peers). A transaction is an execution of the smart contract code which can be performed in response to conditions associated with the smart contract being satisfied. The executing of the smart contract may trigger a trusted modification(s) to a state of a digital blockchain ledger. The modification(s) to the blockchain ledger caused by the smart contract execution may be automatically replicated throughout the distributed network of blockchain peers through one or more consensus protocols.

The smart contract may write data to the blockchain in the format of key-value pairs. Furthermore, the smart contract code can read the values stored in a blockchain and use them in application operations. The smart contract code can write the output of various logic operations into the blockchain. The code may be used to create a temporary data structure in a virtual machine or other computing platform. Data written to the blockchain can be public and/or can be encrypted and maintained as private. The temporary data that is used/generated by the smart contract is held in memory by the supplied execution environment, then deleted once the data needed for the blockchain is identified.

A chaincode may include the code interpretation of a smart contract, with additional features. As described herein, the chaincode may be program code deployed on a computing network, where it is executed and validated by chain validators together during a consensus process. The chaincode receives a hash and retrieves from the blockchain a hash associated with the data template created by use of a previously stored feature extractor. If the hashes of the hash identifier and the hash created from the stored identifier template data match, then the chaincode sends an authorization key to the requested service. The chaincode may write to the blockchain data associated with the cryptographic details.

FIG. 2B illustrates an example of a blockchain transactional flow 250 between nodes of the blockchain in accordance with an example embodiment. Referring to FIG. 2B, the transaction flow may include a transaction proposal 291 sent by an application client node 260 to an endorsing peer node 281. The endorsing peer 281 may verify the client signature and execute a chaincode function to initiate the transaction. The output may include the chaincode results, a set of key/value versions that were read in the chaincode (read set), and the set of keys/values that were written in chaincode (write set). The proposal response 292 is sent back to the client 260 along with an endorsement signature, if approved. The client 260 assembles the endorsements into a transaction payload 293 and broadcasts it to an ordering service node 284. The ordering service node 284 then delivers ordered transactions as blocks to all peers 281-283 on a channel. Before committal to the blockchain, each peer 281-283 may validate the transaction. For example, the peers may check the endorsement policy to ensure that the correct allotment of the specified peers have signed the results and authenticated the signatures against the transaction payload 293.

Referring again to FIG. 2B, the client node 260 initiates the transaction 291 by constructing and sending a request to the peer node 281, which is an endorser. The client 260 may include an application leveraging a supported software development kit (SDK), which utilizes an available API to generate a transaction proposal. The proposal is a request to invoke a chaincode function so that data can be read and/or written to the ledger (i.e., write new key value pairs for the assets). The SDK may serve as a shim to package the transaction proposal into a properly architected format (e.g., protocol buffer over a remote procedure call (RPC)) and take the client's cryptographic credentials to produce a unique signature for the transaction proposal.

In response, the endorsing peer node 281 may verify (a) that the transaction proposal is well formed, (b) the transaction has not been submitted already in the past (replay-attack protection), (c) the signature is valid, and (d) that the submitter (client 260, in the example) is properly authorized to perform the proposed operation on that channel. The endorsing peer node 281 may take the transaction proposal inputs as arguments to the invoked chaincode function. The chaincode is then executed against a current state database to produce transaction results including a response value, read set, and write set. However, no updates are made to the ledger at this point. In 292, the set of values, along with the endorsing peer node's 281 signature is passed back as a proposal response 292 to the SDK of the client 260 which parses the payload for the application to consume.

In response, the application of the client 260 inspects/verifies the endorsing peers signatures and compares the proposal responses to determine if the proposal response is the same. If the chaincode only queried the ledger, the application would inspect the query response and would typically not submit the transaction to the ordering node service 284. If the client application intends to submit the transaction to the ordering node service 284 to update the ledger, the application determines if the specified endorsement policy has been fulfilled before submitting (i.e., did all peer nodes necessary for the transaction endorse the transaction). Here, the client may include only one of multiple parties to the transaction. In this case, each client may have their own endorsing node, and each endorsing node will need to endorse the transaction. The architecture is such that even if an application selects not to inspect responses or otherwise forwards an unendorsed transaction, the endorsement policy will still be enforced by peers and upheld at the commit validation phase.

After successful inspection, in step 293 the client 260 assembles endorsements into a transaction and broadcasts the transaction proposal and response within a transaction message to the ordering node 284. The transaction may contain the read/write sets, the endorsing peers signatures and a channel ID. The ordering node 284 does not need to inspect the entire content of a transaction in order to perform its operation, instead the ordering node 284 may simply receive transactions from all channels in the network, order them chronologically by channel, and create blocks of transactions per channel.

The blocks of the transaction are delivered from the ordering node 284 to all peer nodes 281-283 on the channel. The transactions 294 within the block are validated to ensure any endorsement policy is fulfilled and to ensure that there have been no changes to ledger state for read set variables since the read set was generated by the transaction execution. Transactions in the block are tagged as being valid or invalid. Furthermore, in step 295 each peer node 281-283 appends the block to the channel's chain, and for each valid transaction the write sets are committed to current state database. An event is emitted, to notify the client application that the transaction (invocation) has been immutably appended to the chain, as well as to notify whether the transaction was validated or invalidated.

FIG. 3A illustrates an example of a permissioned blockchain network 300, which features a distributed, decentralized peer-to-peer architecture. In this example, a blockchain user 302 may initiate a transaction to the permissioned blockchain 304. In this example, the transaction can be a deploy, invoke, or query, and may be issued through a client-side application leveraging an SDK, directly through an API, etc. Networks may provide access to a regulator 306, such as an auditor. A blockchain network operator 308 manages member permissions, such as enrolling the regulator 306 as an “auditor” and the blockchain user 302 as a “client”. An auditor could be restricted only to querying the ledger whereas a client could be authorized to deploy, invoke, and query certain types of chaincode.

A blockchain developer 310 can write chaincode and client-side applications. The blockchain developer 310 can deploy chaincode directly to the network through an interface. To include credentials from a traditional data source 312 in chaincode, the developer 310 could use an out-of-band connection to access the data. In this example, the blockchain user 302 connects to the permissioned blockchain 304 through a peer node 314. Before proceeding with any transactions, the peer node 314 retrieves the user's enrollment and transaction certificates from a certificate authority 316, which manages user roles and permissions. In some cases, blockchain users must possess these digital certificates in order to transact on the permissioned blockchain 304. Meanwhile, a user attempting to utilize chaincode may be required to verify their credentials on the traditional data source 312. To confirm the user's authorization, chaincode can use an out-of-band connection to this data through a traditional processing platform 318.

FIG. 3B illustrates another example of a permissioned blockchain network 320, which features a distributed, decentralized peer-to-peer architecture. In this example, a blockchain user 322 may submit a transaction to the permissioned blockchain 324. In this example, the transaction can be a deploy, invoke, or query, and may be issued through a client-side application leveraging an SDK, directly through an API, etc. Networks may provide access to a regulator 326, such as an auditor. A blockchain network operator 328 manages member permissions, such as enrolling the regulator 326 as an “auditor” and the blockchain user 322 as a “client”. An auditor could be restricted only to querying the ledger whereas a client could be authorized to deploy, invoke, and query certain types of chaincode.

A blockchain developer 330 writes chaincode and client-side applications. The blockchain developer 330 can deploy chaincode directly to the network through an interface. To include credentials from a traditional data source 332 in chaincode, the developer 330 could use an out-of-band connection to access the data. In this example, the blockchain user 322 connects to the network through a peer node 334. Before proceeding with any transactions, the peer node 334 retrieves the user's enrollment and transaction certificates from the certificate authority 336. In some cases, blockchain users must possess these digital certificates in order to transact on the permissioned blockchain 324. Meanwhile, a user attempting to utilize chaincode may be required to verify their credentials on the traditional data source 332. To confirm the user's authorization, chaincode can use an out-of-band connection to this data through a traditional processing platform 338.

In some embodiments, the blockchain herein may be a permissionless blockchain. In contrast with permissioned blockchains which require permission to join, anyone can join a permissionless blockchain. For example, to join a permissionless blockchain a user may create a personal address and begin interacting with the network, by submitting transactions, and hence adding entries to the ledger. Additionally, all parties have the choice of running a node on the system and employing the mining protocols to help verify transactions.

FIG. 3C illustrates a process 350 of a transaction being processed by a permissionless blockchain 352 including a plurality of nodes 354. A sender 356 desires to send payment or some other form of value (e.g., a deed, medical records, a contract, a good, a service, or any other asset that can be encapsulated in a digital record) to a recipient 358 via the permissionless blockchain 352. In one embodiment, each of the sender device 356 and the recipient device 358 may have digital wallets (associated with the blockchain 352) that provide user interface controls and a display of transaction parameters. In response, the transaction is broadcast throughout the blockchain 352 to the nodes 354. Depending on the blockchain's 352 network parameters the nodes verify 360 the transaction based on rules (which may be pre-defined or dynamically allocated) established by the permissionless blockchain 352 creators. For example, this may include verifying identities of the parties involved, etc. The transaction may be verified immediately or it may be placed in a queue with other transactions and the nodes 354 determine if the transactions are valid based on a set of network rules.

In structure 362, valid transactions are formed into a block and sealed with a lock (hash). This process may be performed by mining nodes among the nodes 354. Mining nodes may utilize additional software specifically for mining and creating blocks for the permissionless blockchain 352. Each block may be identified by a hash (e.g., 256 bit number, etc.) created using an algorithm agreed upon by the network. Each block may include a header, a pointer or reference to a hash of a previous block's header in the chain, and a group of valid transactions. The reference to the previous block's hash is associated with the creation of the secure independent chain of blocks.

Before blocks can be added to the blockchain, the blocks must be validated. Validation for the permissionless blockchain 352 may include a proof-of-work (PoW) which is a solution to a puzzle derived from the block's header. Although not shown in the example of FIG. 3C, another process for validating a block is proof-of-stake. Unlike the proof-of-work, where the algorithm rewards miners who solve mathematical problems, with the proof of stake, a creator of a new block is chosen in a deterministic way, depending on its wealth, also defined as “stake.” Then, a similar proof is performed by the selected/chosen node.

With mining 364, nodes try to solve the block by making incremental changes to one variable until the solution satisfies a network-wide target. This creates the PoW thereby ensuring correct answers. In other words, a potential solution must prove that computing resources were drained in solving the problem. In some types of permissionless blockchains, miners may be rewarded with value (e.g., coins, etc.) for correctly mining a block.

Here, the PoW process, alongside the chaining of blocks, makes modifications of the blockchain extremely difficult, as an attacker must modify all subsequent blocks in order for the modifications of one block to be accepted. Furthermore, as new blocks are mined, the difficulty of modifying a block increases, and the number of subsequent blocks increases. With distribution 366, the successfully validated block is distributed through the permissionless blockchain 352 and all nodes 354 add the block to a majority chain which is the permissionless blockchain's 352 auditable ledger. Furthermore, the value in the transaction submitted by the sender 356 is deposited or otherwise transferred to the digital wallet of the recipient device 358.

FIG. 4 illustrates a system messaging diagram 400 for processing anonymous transactions in a blockchain, according to example embodiments. Referring to FIG. 4, the system diagram 400 includes an authorizing blockchain client 410, an executing blockchain client 420, and a blockchain network 430.

At block 415, the authorizing blockchain client 410 generates a one-time token or certificate. The one-time token or certificate is transferred 416 to the executing blockchain client 420, and allows a receiving executing blockchain client 420 to submit, one time, an anonymous transaction related to the authorizing blockchain client 410. In one embodiment, the authorizing blockchain client 410 is a supplier, the executing blockchain client 420 is a buyer who purchases goods or a service from the supplier, and the anonymous transaction 446 includes an anonymous rating for the supplier.

In response to receiving the one-time certificate 416, the executing blockchain client 420 generates an add new leaf node blockchain transaction 425 and transfers the add leaf node blockchain transaction 426 to the blockchain network 430. The blockchain network 430 adds the new leaf node to the merkle tree 435. In some embodiments, the executing blockchain client 420 may transfer a request to a trusted blockchain node or peer (not shown) which may generate the add leaf node blockchain transaction 426 in response to the request. Subsequently, the executing blockchain client 420 may generate a rating and a proof 440 according to some predetermined criteria such as a range or value of ratings. The executing blockchain client 420 may generate an anonymous transaction 445. In one embodiment, the executing blockchain client 420 provides a request that includes the rating, a proof that the new leaf node has been added to the merkle tree, a nullifier for the added new leaf node, and a root node value to a trusted blockchain node or peer (not shown), which converts the request into an anonymous blockchain transaction 446. The anonymous blockchain transaction 446 requests the blockchain network 430 to add the rating anonymously to a shared ledger for the blockchain network 430.

Upon receiving the anonymous blockchain transaction 446, a smart contract of the blockchain network 430 verifies the proof 450 and verifies the root node value 455 as a valid current or previous merkle tree root node value, and verifies that the nullifier has not been used previously. Once they are verified, the smart contract stores the anonymous rating 460 to the shared ledger, marks the nullifier as used, and also stores the marked nullifier 465 to the shared ledger, thereby ensuring that the corresponding leaf node is not used in the future to add a rating. The authorizing client 410 is unable to associate the anonymous rating with the leaf node which was used for the proof and the nullifier, and thereby the identity of the executing client 420 is not revealed, thus ensuring anonymity of the transaction.

FIG. 5A illustrates a flow diagram 500 for updating an anonymous rating in a blockchain, according to example embodiments. Referring to FIG. 5A, the method 500 may include one or more of the following steps.

At block 504, an executing client 108 receives a one-time token or certificate 140 from an authorizing client 104. The one-time token or certificate 140 allows the executing client 108 to submit a rating anonymously one time, where the anonymous rating is related to the authorizing client 104. The token or coin could be some standard cryptographically verifiable one-time usable certificate 140. In one embodiment, the one-time token or certificate 140 is received by the executing client 108 after a good or service has been received 144. In another embodiment, the executing client 108 may receive the one-time token or certificate 140 at the same time goods or a service has been received 144. The token information may be part of the notification of goods delivery the authorizing client 104 sends to the executing client 108 offline (outside the blockchain).

At block 508, a new leaf node is added to a merkle tree 120 that corresponds to the authorizing client 104. One or more authorizing clients 104 may be present, and a shared ledger 116 of a blockchain network may include a different merkle tree 120 for each authorizing client 104. The leaf nodes of each merkle tree 120 may each include a unique anonymous rating 160 from an executing client 108, and the system may include multiple executing clients 108. The new leaf node must first be created prior to storing a new anonymous rating 160 to the merkle tree 120.

The executing client 108 chooses a random secret x, known only to the executing client 108. Using the one-time token 140, the executing client 108 invokes the smart contract or chaincode 132 to add a leaf node 1=h(x) to a merkle tree 120 that corresponds to the authorizing client 104. This operation by itself is not anonymous. The notation “h(x)” denotes a distinct and unlinkable hash function. The value of x is hard to infer from the value of h(x). For example, we may take h to be the standard SHA-256 hash function. The smart contract or chaincode 132 adds a leaf value (provided as an argument) to a next available leaf in the merkle tree 120 (in the left-to-right order) and updates the path from the added leaf to the root node.

The executing client 108 privately computes a zero knowledge proof showing that the executing client 108 has the random secret x subject to L=h(x), where L is a leaf node on the merkle tree 120, and the nullifier 168 y=h2(x). The zero-knowledge proof adds a rating 160 related to the authorizing client 104. The representation of the proof 164 is in a predefined format (a sequence of bits or characters) and is intended to prove that there is some leaf node whose value is h(x) (for some value of the random secret x) in the merkle tree 120 such that the executing client 108 knows the value of x, and that the nullifier 168 that the executing client 108 has provided is h2(x), all in zero-knowledge (i.e. without revealing any additional information in particular the value of x or h(x)).

At block 512, the executing client creates a request to add a new anonymous rating to the authorization client merkle tree. The request includes the anonymous rating, a nullifier, a root node value for the authorizing client merkle tree, and a proof. The executing client queries the smart contract or chaincode 132 for a root node value of the merkle tree 120, and the sequence of sibling nodes on a path from the new leaf node to the root node (authentication path). The executing client 108 then computes a nullifier y=h2(x). The notation “h2(x)” denotes another distinct and unlinkable hash function. The value of h(x) is hard to infer from that of h2(x) and vice versa. Further, the value of h(x) is hard to infer from that of h2(x) and vice versa. For example, we may take h2(x) to be SHA-256 with a non-standard initialization vector.

The request to add the new anonymous rating 160 is provided to a trusted blockchain node or peer 112 of the blockchain network. The trusted blockchain node or peer 112 creates and submits a blockchain transaction 156 to the blockchain network, from the request to add the new anonymous rating 160.

At block 516, a smart contract or chaincode 132 of the blockchain network verifies the proof 164. The proof 164 is verified using the root node value and the nullifier 168. The nullifier 168 of this leaf node is the value h2(x)—which is unique and cannot be inferred from or linked to h(x). This is used to prevent a leaf node from being reused again as the chaincode (smart contract) 132 checks whether a nullifier 168 has been previously used when it is provided by the executing client 108 when the corresponding leaf node is sought to be used to provide a rating. If the zero-knowledge proof 164 is verified and the nullifier 168 has not previously been used, the rating 160 is added and the nullifier 168 is stored in the shared ledger 116 and is marked as “used”.

At block 520, the smart contract or chaincode 132 validates the transaction 156 by verifying that the root node value 172 is one of a current or a previous merkle tree root node value. The executing client 108 invokes the smart contract or chaincode 132 with the zero-knowledge proof 164, y=h2(x), and the anonymous rating 160 within a specified range. The proof 164 may be verified by the smart contract or chaincode 132 using the nullifier 168 and the root value of the merkle tree to ascertain that executing client's claim is indeed correct and is authorized to add the anonymous rating 160. Since the value of x or h(x) is not revealed, which leaf node is sought to be used is also not revealed, and thus the privacy of the identity of the executing client 108 is also not revealed.

If the validation is not successful, the transaction 156 is not endorsed by the blockchain peer, and the executing client 108 would receive a failure message indicating the same. The shared ledger data 116 would be unchanged. If the transaction execution by the peer is successful and the nullifier 168 has not been previously used, an endorsed transaction is created consisting of a read-set and a write-set of key-value pair which is then transmitted for commitment on the blockchain peers according to some consensus mechanism. The shared ledger data 116 changes at the time of commitment. The anonymous rating 160 is added to the new leaf node and the nullifier 168 value is stored as a used nullifier so that it may be checked against newer nullifiers 168.

At block 524, in response to validating the transaction, the anonymous rating 160 is added to the new leaf node of the authorization client merkle tree 120. The anonymous rating 160 may then be retrieved and either presented to a blockchain node or peer, or used in other rating calculations including average authorization client rating calculations. The smart contract or chaincode 132 also marks the nullifier 168 as used and stores the marked nullifier to the shared ledger 116.

FIG. 5B illustrates a flow diagram 530 for lookback key verification in a blockchain, according to example embodiments. Referring to FIG. 5B, the method 530 may include one or more of the following steps.

At block 534, an authorizing client 104 provides a one-time token or certificate 140 to an executing client 108, which allows the executing client 108 to submit a rating anonymously one time to a blockchain network—where the anonymous rating 160 is related to the authorizing client 104. The executing client 108 requests that new leaf node be added to a merkle tree 120 that corresponds to the authorizing client 104. One or more authorizing clients 104 may be present, and a shared ledger 116 of the blockchain network may include a different merkle tree for each authorizing client 104. The leaf nodes of each merkle tree may each include a unique anonymous rating from an executing client 108, and the system may include multiple executing clients 108. The new leaf node must first be created prior to storing a new anonymous rating 160 to the merkle tree 120.

At block 538, a trusted blockchain node or peer 112 creates and submits a blockchain transaction 156 to the blockchain network to add the anonymous rating 160 to the merkle tree 120, from the request 152 to add the new anonymous rating.

At block 542, a smart contract or chaincode 132 of the blockchain network verifies the proof 164. The proof 164 is verified using the root node value 172 and the nullifier 168.

At block 546, the smart contract or chaincode 132 identifies a lookback key 124. The smart contract or chaincode 132 includes a valid historical value assert call 136 , which identifies a lookback key 124 storing the merkle tree root node value.

At block 550, the smart contract or chaincode 132 verifies the merkle tree root node value using the valid historical value assert 136 on the lookback key 124.

At block 554, in response to verifying the merkle tree root node value, the smart contract or chaincode 132 adds the anonymous rating 160 to the new leaf node of the authorization client merkle tree 120. The anonymous rating 160 may then be retrieved and either presented to a blockchain node or peer, or used in other rating calculations including average authorization client rating calculations. The smart contract or chaincode 132 also marks the nullifier 168 as used and stores the marked nullifier to the shared ledger 116.

FIG. 5C illustrates a flow diagram 560 of an example method of granting access based on user rating, according to example embodiments. Referring to FIG. 5C, the method 560 may include one or more of the following steps.

At block 564, metrics related to network access are received. An access policy enforcement system receives metrics (as represented by a voucher, for example) relating to access to a network resource.

At block 568, a user rating is updated. The system then updates a user rating based on the received metrics.

At block 572, a user access request is received by the system.

At block 576, access is granted based on the user rating. In response to the request, the system grants an access level that is based on the determined user rating.

At block 580, a device is configured according to an access level. The system dynamically configures one or more network devices according to the granted access level.

FIG. 6A illustrates an example system 600 that includes a physical infrastructure 610 configured to perform various operations according to example embodiments. Referring to FIG. 6A, the physical infrastructure 610 includes a module 612 and a module 614. The module 614 includes a blockchain 620 and a smart contract 630 (which may reside on the blockchain 620), that may execute any of the operational steps 608 (in module 612) included in any of the example embodiments. The steps/operations 608 may include one or more of the embodiments described or depicted and may represent output or written information that is written or read from one or more smart contracts 630 and/or blockchains 620. The physical infrastructure 610, the module 612, and the module 614 may include one or more computers, servers, processors, memories, and/or wireless communication devices. Further, the module 612 and the module 614 may be a same module.

FIG. 6B illustrates another example system 640 configured to perform various operations according to example embodiments. Referring to FIG. 6B, the system 640 includes a module 612 and a module 614. The module 614 includes a blockchain 620 and a smart contract 630 (which may reside on the blockchain 620), that may execute any of the operational steps 608 (in module 612) included in any of the example embodiments. The steps/operations 608 may include one or more of the embodiments described or depicted and may represent output or written information that is written or read from one or more smart contracts 630 and/or blockchains 620. The physical infrastructure 610, the module 612, and the module 614 may include one or more computers, servers, processors, memories, and/or wireless communication devices. Further, the module 612 and the module 614 may be a same module.

FIG. 6C illustrates an example system configured to utilize a smart contract configuration among contracting parties and a mediating server configured to enforce the smart contract terms on the blockchain according to example embodiments. Referring to FIG. 6C, the configuration 650 may represent a communication session, an asset transfer session or a process or procedure that is driven by a smart contract 630 which explicitly identifies one or more user devices 652 and/or 656. The execution, operations and results of the smart contract execution may be managed by a server 654. Content of the smart contract 630 may require digital signatures by one or more of the entities 652 and 656 which are parties to the smart contract transaction. The results of the smart contract execution may be written to a blockchain 620 as a blockchain transaction. The smart contract 630 resides on the blockchain 620 which may reside on one or more computers, servers, processors, memories, and/or wireless communication devices.

FIG. 6D illustrates a system 660 including a blockchain, according to example embodiments. Referring to the example of FIG. 6D, an application programming interface (API) gateway 662 provides a common interface for accessing blockchain logic (e.g., smart contract 630 or other chaincode) and data (e.g., distributed ledger, etc.). In this example, the API gateway 662 is a common interface for performing transactions (invoke, queries, etc.) on the blockchain by connecting one or more entities 652 and 656 to a blockchain peer (i.e., server 654). Here, the server 654 is a blockchain network peer component that holds a copy of the world state and a distributed ledger allowing clients 652 and 656 to query data on the world state as well as submit transactions into the blockchain network where, depending on the smart contract 630 and endorsement policy, endorsing peers will run the smart contracts 630.

The above embodiments may be implemented in hardware, in a computer program executed by a processor, in firmware, or in a combination of the above. A computer program may be embodied on a computer readable medium, such as a storage medium. For example, a computer program may reside in random access memory (“RAM”), flash memory, read-only memory (“ROM”), erasable programmable read-only memory (“EPROM”), electrically erasable programmable read-only memory (“EEPROM”), registers, hard disk, a removable disk, a compact disk read-only memory (“CD-ROM”), or any other form of storage medium known in the art.

An exemplary storage medium may be coupled to the processor such that the processor may read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an application specific integrated circuit (“ASIC”). In the alternative, the processor and the storage medium may reside as discrete components.

FIG. 7A illustrates a process 700 of a new block being added to a distributed ledger 720, according to example embodiments, and FIG. 7B illustrates contents of a new data block structure 730 for blockchain, according to example embodiments. Referring to FIG. 7A, clients (not shown) may submit transactions to blockchain nodes 711, 712, and/or 713. Clients may be instructions received from any source to enact activity on the blockchain 720. As an example, clients may be applications that act on behalf of a requester, such as a device, person or entity to propose transactions for the blockchain. The plurality of blockchain peers (e.g., blockchain nodes 711, 712, and 713) may maintain a state of the blockchain network and a copy of the distributed ledger 720. Different types of blockchain nodes/peers may be present in the blockchain network including endorsing peers which simulate and endorse transactions proposed by clients and committing peers which verify endorsements, validate transactions, and commit transactions to the distributed ledger 720. In this example, the blockchain nodes 711, 712, and 713 may perform the role of endorser node, committer node, or both.

The distributed ledger 720 includes a blockchain which stores immutable, sequenced records in blocks, and a state database 724 (current world state) maintaining a current state of the blockchain 722. One distributed ledger 720 may exist per channel and each peer maintains its own copy of the distributed ledger 720 for each channel of which they are a member. The blockchain 722 is a transaction log, structured as hash-linked blocks where each block contains a sequence of N transactions. Blocks may include various components such as shown in FIG. 7B. The linking of the blocks (shown by arrows in FIG. 7A) may be generated by adding a hash of a prior block's header within a block header of a current block. In this way, all transactions on the blockchain 722 are sequenced and cryptographically linked together preventing tampering with blockchain data without breaking the hash links. Furthermore, because of the links, the latest block in the blockchain 722 represents every transaction that has come before it. The blockchain 722 may be stored on a peer file system (local or attached storage), which supports an append-only blockchain workload.

The current state of the blockchain 722 and the distributed ledger 722 may be stored in the state database 724. Here, the current state data represents the latest values for all keys ever included in the chain transaction log of the blockchain 722. Chaincode invocations execute transactions against the current state in the state database 724. To make these chaincode interactions extremely efficient, the latest values of all keys are stored in the state database 724. The state database 724 may include an indexed view into the transaction log of the blockchain 722, it can therefore be regenerated from the chain at any time. The state database 724 may automatically get recovered (or generated if needed) upon peer startup, before transactions are accepted.

Endorsing nodes receive transactions from clients and endorse the transaction based on simulated results. Endorsing nodes hold smart contracts which simulate the transaction proposals. When an endorsing node endorses a transaction, the endorsing nodes creates a transaction endorsement which is a signed response from the endorsing node to the client application indicating the endorsement of the simulated transaction. The method of endorsing a transaction depends on an endorsement policy which may be specified within chaincode. An example of an endorsement policy is “the majority of endorsing peers must endorse the transaction”. Different channels may have different endorsement policies. Endorsed transactions are forward by the client application to ordering service 710.

The ordering service 710 accepts endorsed transactions, orders them into a block, and delivers the blocks to the committing peers. For example, the ordering service 710 may initiate a new block when a threshold of transactions has been reached, a timer times out, or another condition. In the example of FIG. 7A, blockchain node 712 is a committing peer that has received a new data new data block 730 for storage on blockchain 720. The first block in the blockchain may be referred to as a genesis block which includes information about the blockchain, its members, the data stored therein, etc.

The ordering service 710 may be made up of a cluster of orderers. The ordering service 710 does not process transactions, smart contracts, or maintain the shared ledger. Rather, the ordering service 710 may accept the endorsed transactions and specifies the order in which those transactions are committed to the distributed ledger 720. The architecture of the blockchain network may be designed such that the specific implementation of ‘ordering’ (e.g., Solo, Kafka, BFT, etc.) becomes a pluggable component.

Transactions are written to the distributed ledger 720 in a consistent order. The order of transactions is established to ensure that the updates to the state database 724 are valid when they are committed to the network. Unlike a cryptocurrency blockchain system (e.g., Bitcoin, etc.) where ordering occurs through the solving of a cryptographic puzzle, or mining, in this example the parties of the distributed ledger 720 may choose the ordering mechanism that best suits that network.

When the ordering service 710 initializes a new data block 730, the new data block 730 may be broadcast to committing peers (e.g., blockchain nodes 711, 712, and 713). In response, each committing peer validates the transaction within the new data block 730 by checking to make sure that the read set and the write set still match the current world state in the state database 724. Specifically, the committing peer can determine whether the read data that existed when the endorsers simulated the transaction is identical to the current world state in the state database 724. When the committing peer validates the transaction, the transaction is written to the blockchain 722 on the distributed ledger 720, and the state database 724 is updated with the write data from the read-write set. If a transaction fails, that is, if the committing peer finds that the read-write set does not match the current world state in the state database 724, the transaction ordered into a block will still be included in that block, but it will be marked as invalid, and the state database 724 will not be updated.

Referring to FIG. 7B, a new data block 730 (also referred to as a data block) that is stored on the blockchain 722 of the distributed ledger 720 may include multiple data segments such as a block header 740, block data 750, and block metadata 760. It should be appreciated that the various depicted blocks and their contents, such as new data block 730 and its contents. shown in FIG. 7B are merely examples and are not meant to limit the scope of the example embodiments. The new data block 730 may store transactional information of N transaction(s) (e.g., 1, 10, 100, 500, 1000, 2000, 3000, etc.) within the block data 750. The new data block 730 may also include a link to a previous block (e.g., on the blockchain 722 in FIG. 7A) within the block header 740. In particular, the block header 740 may include a hash of a previous block's header. The block header 740 may also include a unique block number, a hash of the block data 750 of the new data block 730, and the like. The block number of the new data block 730 may be unique and assigned in various orders, such as an incremental/sequential order starting from zero.

The block data 750 may store transactional information of each transaction that is recorded within the new data block 730. For example, the transaction data may include one or more of a type of the transaction, a version, a timestamp, a channel ID of the distributed ledger 720, a transaction ID, an epoch, a payload visibility, a chaincode path (deploy tx), a chaincode name, a chaincode version, input (chaincode and functions), a client (creator) identify such as a public key and certificate, a signature of the client, identities of endorsers, endorser signatures, a proposal hash, chaincode events, response status, namespace, a read set (list of key and version read by the transaction, etc.), a write set (list of key and value, etc.), a start key, an end key, a list of keys, a Merkel tree query summary, and the like. The transaction data may be stored for each of the N transactions.

In some embodiments, the block data 750 may also store new data 762 which adds additional information to the hash-linked chain of blocks in the blockchain 722. The additional information includes one or more of the steps, features, processes and/or actions described or depicted herein. Accordingly, the new data 762 can be stored in an immutable log of blocks on the distributed ledger 720. Some of the benefits of storing such new data 762 are reflected in the various embodiments disclosed and depicted herein. Although in FIG. 7B the new data 762 is depicted in the block data 750 but could also be located in the block header 740 or the block metadata 760.

The block metadata 760 may store multiple fields of metadata (e.g., as a byte array, etc.). Metadata fields may include signature on block creation, a reference to a last configuration block, a transaction filter identifying valid and invalid transactions within the block, last offset persisted of an ordering service that ordered the block, and the like. The signature, the last configuration block, and the orderer metadata may be added by the ordering service 710. Meanwhile, a committer of the block (such as blockchain node 712) may add validity/invalidity information based on an endorsement policy, verification of read/write sets, and the like. The transaction filter may include a byte array of a size equal to the number of transactions in the block data 750 and a validation code identifying whether a transaction was valid/invalid.

FIG. 7C illustrates an embodiment of a blockchain 770 for digital content in accordance with the embodiments described herein. The digital content may include one or more files and associated information. The files may include media, images, video, audio, text, links, graphics, animations, web pages, documents, or other forms of digital content. The immutable, append-only aspects of the blockchain serve as a safeguard to protect the integrity, validity, and authenticity of the digital content, making it suitable use in legal proceedings where admissibility rules apply or other settings where evidence is taken in to consideration or where the presentation and use of digital information is otherwise of interest. In this case, the digital content may be referred to as digital evidence.

The blockchain may be formed in various ways. In one embodiment, the digital content may be included in and accessed from the blockchain itself. For example, each block of the blockchain may store a hash value of reference information (e.g., header, value, etc.) along the associated digital content. The hash value and associated digital content may then be encrypted together. Thus, the digital content of each block may be accessed by decrypting each block in the blockchain, and the hash value of each block may be used as a basis to reference a previous block. This may be illustrated as follows:

Block 1 Block 2 . . . Block N Hash Value 1 Hash Value 2 Hash Value N Digital Content 1 Digital Content 2 Digital Content N

In one embodiment, the digital content may be not included in the blockchain. For example, the blockchain may store the encrypted hashes of the content of each block without any of the digital content. The digital content may be stored in another storage area or memory address in association with the hash value of the original file. The other storage area may be the same storage device used to store the blockchain or may be a different storage area or even a separate relational database. The digital content of each block may be referenced or accessed by obtaining or querying the hash value of a block of interest and then looking up that has value in the storage area, which is stored in correspondence with the actual digital content. This operation may be performed, for example, a database gatekeeper. This may be illustrated as follows:

Blockchain Storage Area Block 1 Hash Value Block 1 Hash Value . . . Content . . . . . . Block N Hash Value Block N Hash Value . . . Content

In the example embodiment of FIG. 7C, the blockchain 770 includes a number of blocks 778 ₁, 778 ₂, . . . 778 _(N) cryptographically linked in an ordered sequence, where N≥1. The encryption used to link the blocks 778 ₁, 778 ₂, . . . 778 _(N) may be any of a number of keyed or un-keyed Hash functions. In one embodiment, the blocks 778 ₁, 778 ₂, . . . 778 _(N) are subject to a hash function which produces n-bit alphanumeric outputs (where n is 256 or another number) from inputs that are based on information in the blocks. Examples of such a hash function include, but are not limited to, a SHA-type (SHA stands for Secured Hash Algorithm) algorithm, Merkle-Damgard algorithm, HAIFA algorithm, Merkle-tree algorithm, nonce-based algorithm, and a non-collision-resistant PRF algorithm. In another embodiment, the blocks 778 ₁, 778 ₂, . . . , 778 _(N) may be cryptographically linked by a function that is different from a hash function. For purposes of illustration, the following description is made with reference to a hash function, e.g., SHA-2.

Each of the blocks 778 ₁, 778 ₂, . . . , 778 _(N) in the blockchain includes a header, a version of the file, and a value. The header and the value are different for each block as a result of hashing in the blockchain. In one embodiment, the value may be included in the header. As described in greater detail below, the version of the file may be the original file or a different version of the original file.

The first block 778 ₁ in the blockchain is referred to as the genesis block and includes the header 772 ₁, original file 774 ₁, and an initial value 776 ₁. The hashing scheme used for the genesis block, and indeed in all subsequent blocks, may vary. For example, all the information in the first block 778 ₁ may be hashed together and at one time, or each or a portion of the information in the first block 778 ₁ may be separately hashed and then a hash of the separately hashed portions may be performed.

The header 772 ₁ may include one or more initial parameters, which, for example, may include a version number, timestamp, nonce, root information, difficulty level, consensus protocol, duration, media format, source, descriptive keywords, and/or other information associated with original file 774 ₁ and/or the blockchain. The header 772 ₁ may be generated automatically (e.g., by blockchain network managing software) or manually by a blockchain participant. Unlike the header in other blocks 778 ₂ to 778 _(N) in the blockchain, the header 772 ₁ in the genesis block does not reference a previous block, simply because there is no previous block.

The original file 774 ₁ in the genesis block may be, for example, data as captured by a device with or without processing prior to its inclusion in the blockchain. The original file 774 ₁ is received through the interface of the system from the device, media source, or node. The original file 774 ₁ is associated with metadata, which, for example, may be generated by a user, the device, and/or the system processor, either manually or automatically. The metadata may be included in the first block 778 ₁ in association with the original file 774 ₁.

The value 776 ₁ in the genesis block is an initial value generated based on one or more unique attributes of the original file 774 ₁. In one embodiment, the one or more unique attributes may include the hash value for the original file 774 ₁, metadata for the original file 774 ₁, and other information associated with the file. In one implementation, the initial value 776 ₁ may be based on the following unique attributes:

-   -   1) SHA-2 computed hash value for the original file     -   2) originating device ID     -   3) starting timestamp for the original file     -   4) initial storage location of the original file     -   5) blockchain network member ID for software to currently         control the original file and associated metadata

The other blocks 778 ₂ to 778 _(N) in the blockchain also have headers, files, and values. However, unlike the first block 772 ₁, each of the headers 772 ₂ to 772 _(N) in the other blocks includes the hash value of an immediately preceding block. The hash value of the immediately preceding block may be just the hash of the header of the previous block or may be the hash value of the entire previous block. By including the hash value of a preceding block in each of the remaining blocks, a trace can be performed from the Nth block back to the genesis block (and the associated original file) on a block-by-block basis, as indicated by arrows 780, to establish an auditable and immutable chain-of-custody.

Each of the header 772 ₂ to 772 _(N) in the other blocks may also include other information, e.g., version number, timestamp, nonce, root information, difficulty level, consensus protocol, and/or other parameters or information associated with the corresponding files and/or the blockchain in general.

The files 774 ₂ to 774 _(N) in the other blocks may be equal to the original file or may be a modified version of the original file in the genesis block depending, for example, on the type of processing performed. The type of processing performed may vary from block to block. The processing may involve, for example, any modification of a file in a preceding block, such as redacting information or otherwise changing the content of, taking information away from, or adding or appending information to the files.

Additionally, or alternatively, the processing may involve merely copying the file from a preceding block, changing a storage location of the file, analyzing the file from one or more preceding blocks, moving the file from one storage or memory location to another, or performing action relative to the file of the blockchain and/or its associated metadata. Processing which involves analyzing a file may include, for example, appending, including, or otherwise associating various analytics, statistics, or other information associated with the file.

The values in each of the other blocks 776 ₂ to 776 _(N) in the other blocks are unique values and are all different as a result of the processing performed. For example, the value in any one block corresponds to an updated version of the value in the previous block. The update is reflected in the hash of the block to which the value is assigned. The values of the blocks therefore provide an indication of what processing was performed in the blocks and also permit a tracing through the blockchain back to the original file. This tracking confirms the chain-of-custody of the file throughout the entire blockchain.

For example, consider the case where portions of the file in a previous block are redacted, blocked out, or pixelated in order to protect the identity of a person shown in the file. In this case, the block including the redacted file will include metadata associated with the redacted file, e.g., how the redaction was performed, who performed the redaction, timestamps where the redaction(s) occurred, etc. The metadata may be hashed to form the value. Because the metadata for the block is different from the information that was hashed to form the value in the previous block, the values are different from one another and may be recovered when decrypted.

In one embodiment, the value of a previous block may be updated (e.g., a new hash value computed) to form the value of a current block when any one or more of the following occurs. The new hash value may be computed by hashing all or a portion of the information noted below, in this example embodiment.

-   -   a) new SHA-2 computed hash value if the file has been processed         in any way (e.g., if the file was redacted, copied, altered,         accessed, or some other action was taken)     -   b) new storage location for the file     -   c) new metadata identified associated with the file     -   d) transfer of access or control of the file from one blockchain         participant to another blockchain participant

FIG. 7D illustrates an embodiment of a block which may represent the structure of the blocks in the blockchain 790 in accordance with one embodiment. The block, Block_(i), includes a header 772 _(i), a file 774 _(i), and a value 776 _(i).

The header 772 _(i) includes a hash value of a previous block Block_(i-1) and additional reference information, which, for example, may be any of the types of information (e.g., header information including references, characteristics, parameters, etc.) discussed herein. All blocks reference the hash of a previous block except, of course, the genesis block. The hash value of the previous block may be just a hash of the header in the previous block or a hash of all or a portion of the information in the previous block, including the file and metadata.

The file 774 _(i) includes a plurality of data, such as Data 1, Data 2, . . . , Data N in sequence. The data are tagged with metadata Metadata 1, Metadata 2, . . . , Metadata N which describe the content and/or characteristics associated with the data. For example, the metadata for each data may include information to indicate a timestamp for the data, process the data, keywords indicating the persons or other content depicted in the data, and/or other features that may be helpful to establish the validity and content of the file as a whole, and particularly its use a digital evidence, for example, as described in connection with an embodiment discussed below. In addition to the metadata, each data may be tagged with reference REF₁, REF₂, . . , REF_(N) to a previous data to prevent tampering, gaps in the file, and sequential reference through the file.

Once the metadata is assigned to the data (e.g., through a smart contract), the metadata cannot be altered without the hash changing, which can easily be identified for invalidation. The metadata, thus, creates a data log of information that may be accessed for use by participants in the blockchain.

The value 776 _(i) is a hash value or other value computed based on any of the types of information previously discussed. For example, for any given block Block_(i), the value for that block may be updated to reflect the processing that was performed for that block, e.g., new hash value, new storage location, new metadata for the associated file, transfer of control or access, identifier, or other action or information to be added. Although the value in each block is shown to be separate from the metadata for the data of the file and header, the value may be based, in part or whole, on this metadata in another embodiment.

Once the blockchain 770 is formed, at any point in time, the immutable chain-of-custody for the file may be obtained by querying the blockchain for the transaction history of the values across the blocks. This query, or tracking procedure, may begin with decrypting the value of the block that is most currently included (e.g., the last (N^(th)) block), and then continuing to decrypt the value of the other blocks until the genesis block is reached and the original file is recovered. The decryption may involve decrypting the headers and files and associated metadata at each block, as well.

Decryption is performed based on the type of encryption that took place in each block. This may involve the use of private keys, public keys, or a public key-private key pair. For example, when asymmetric encryption is used, blockchain participants or a processor in the network may generate a public key and private key pair using a predetermined algorithm. The public key and private key are associated with each other through some mathematical relationship. The public key may be distributed publicly to serve as an address to receive messages from other users, e.g., an IP address or home address. The private key is kept secret and used to digitally sign messages sent to other blockchain participants. The signature is included in the message so that the recipient can verify using the public key of the sender. This way, the recipient can be sure that only the sender could have sent this message.

Generating a key pair may be analogous to creating an account on the blockchain, but without having to actually register anywhere. Also, every transaction that is executed on the blockchain is digitally signed by the sender using their private key. This signature ensures that only the owner of the account can track and process (if within the scope of permission determined by a smart contract) the file of the blockchain.

FIGS. 8A and 8B illustrate additional examples of use cases for blockchain which may be incorporated and used herein. In particular, FIG. 8A illustrates an example 800 of a blockchain 810 which stores machine learning (artificial intelligence) data. Machine learning relies on vast quantities of historical data (or training data) to build predictive models for accurate prediction on new data. Machine learning software (e.g., neural networks, etc.) can often sift through millions of records to unearth non-intuitive patterns.

In the example of FIG. 8A, a host platform 820 builds and deploys a machine learning model for predictive monitoring of assets 830. Here, the host platform 820 may be a cloud platform, an industrial server, a web server, a personal computer, a user device, and the like. Assets 830 can be any type of asset (e.g., machine or equipment, etc.) such as an aircraft, locomotive, turbine, medical machinery and equipment, oil and gas equipment, boats, ships, vehicles, and the like. As another example, assets 830 may be non-tangible assets such as stocks, currency, digital coins, insurance, or the like.

The blockchain 810 can be used to significantly improve both a training process 802 of the machine learning model and a predictive process 804 based on a trained machine learning model. For example, in 802, rather than requiring a data scientist/engineer or other user to collect the data, historical data may be stored by the assets 830 themselves (or through an intermediary, not shown) on the blockchain 810. This can significantly reduce the collection time needed by the host platform 820 when performing predictive model training. For example, using smart contracts, data can be directly and reliably transferred straight from its place of origin to the blockchain 810. By using the blockchain 810 to ensure the security and ownership of the collected data, smart contracts may directly send the data from the assets to the individuals that use the data for building a machine learning model. This allows for sharing of data among the assets 830.

The collected data may be stored in the blockchain 810 based on a consensus mechanism. The consensus mechanism pulls in (permissioned nodes) to ensure that the data being recorded is verified and accurate. The data recorded is time-stamped, cryptographically signed, and immutable. It is therefore auditable, transparent, and secure. Adding IoT devices which write directly to the blockchain can, in certain cases (i.e. supply chain, healthcare, logistics, etc.), increase both the frequency and accuracy of the data being recorded.

Furthermore, training of the machine learning model on the collected data may take rounds of refinement and testing by the host platform 820. Each round may be based on additional data or data that was not previously considered to help expand the knowledge of the machine learning model. In 802, the different training and testing steps (and the data associated therewith) may be stored on the blockchain 810 by the host platform 820. Each refinement of the machine learning model (e.g., changes in variables, weights, etc.) may be stored on the blockchain 810. This provides verifiable proof of how the model was trained and what data was used to train the model. Furthermore, when the host platform 820 has achieved a finally trained model, the resulting model may be stored on the blockchain 810.

After the model has been trained, it may be deployed to a live environment where it can make predictions/decisions based on the execution of the final trained machine learning model. For example, in 804, the machine learning model may be used for condition-based maintenance (CBM) for an asset such as an aircraft, a wind turbine, a healthcare machine, and the like. In this example, data fed back from the asset 830 may be input the machine learning model and used to make event predictions such as failure events, error codes, and the like. Determinations made by the execution of the machine learning model at the host platform 820 may be stored on the blockchain 810 to provide auditable/verifiable proof. As one non-limiting example, the machine learning model may predict a future breakdown/failure to a part of the asset 830 and create alert or a notification to replace the part. The data behind this decision may be stored by the host platform 820 on the blockchain 810. In one embodiment the features and/or the actions described and/or depicted herein can occur on or with respect to the blockchain 810.

New transactions for a blockchain can be gathered together into a new block and added to an existing hash value. This is then encrypted to create a new hash for the new block. This is added to the next list of transactions when they are encrypted, and so on. The result is a chain of blocks that each contain the hash values of all preceding blocks. Computers that store these blocks regularly compare their hash values to ensure that they are all in agreement. Any computer that does not agree, discards the records that are causing the problem. This approach is good for ensuring tamper-resistance of the blockchain, but it is not perfect.

One way to game this system is for a dishonest user to change the list of transactions in their favor, but in a way that leaves the hash unchanged. This can be done by brute force, in other words by changing a record, encrypting the result, and seeing whether the hash value is the same. And if not, trying again and again and again until it finds a hash that matches. The security of blockchains is based on the belief that ordinary computers can only perform this kind of brute force attack over time scales that are entirely impractical, such as the age of the universe. By contrast, quantum computers are much faster (1000s of times faster) and consequently pose a much greater threat.

FIG. 8B illustrates an example 850 of a quantum-secure blockchain 852 which implements quantum key distribution (QKD) to protect against a quantum computing attack. In this example, blockchain users can verify each other's identities using QKD. This sends information using quantum particles such as photons, which cannot be copied by an eavesdropper without destroying them. In this way, a sender and a receiver through the blockchain can be sure of each other's identity.

In the example of FIG. 8B, four users are present 854, 856, 858, and 860. Each of pair of users may share a secret key 862 (i.e., a QKD) between themselves. Since there are four nodes in this example, six pairs of nodes exists, and therefore six different secret keys 862 are used including QKD_(AB), QKD_(AC), QKD_(AD), QKD_(BC), QKD_(BD), and QKD_(CD). Each pair can create a QKD by sending information using quantum particles such as photons, which cannot be copied by an eavesdropper without destroying them. In this way, a pair of users can be sure of each other's identity.

The operation of the blockchain 852 is based on two procedures (i) creation of transactions, and (ii) construction of blocks that aggregate the new transactions. New transactions may be created similar to a traditional blockchain network. Each transaction may contain information about a sender, a receiver, a time of creation, an amount (or value) to be transferred, a list of reference transactions that justifies the sender has funds for the operation, and the like. This transaction record is then sent to all other nodes where it is entered into a pool of unconfirmed transactions. Here, two parties (i.e., a pair of users from among 854-860) authenticate the transaction by providing their shared secret key 862 (QKD). This quantum signature can be attached to every transaction making it exceedingly difficult to tamper with. Each node checks their entries with respect to a local copy of the blockchain 852 to verify that each transaction has sufficient funds. However, the transactions are not yet confirmed.

Rather than perform a traditional mining process on the blocks, the blocks may be created in a decentralized manner using a broadcast protocol. At a predetermined period of time (e.g., seconds, minutes, hours, etc.) the network may apply the broadcast protocol to any unconfirmed transaction thereby to achieve a Byzantine agreement (consensus) regarding a correct version of the transaction. For example, each node may possess a private value (transaction data of that particular node). In a first round, nodes transmit their private values to each other. In subsequent rounds, nodes communicate the information they received in the previous round from other nodes. Here, honest nodes are able to create a complete set of transactions within a new block. This new block can be added to the blockchain 852. In one embodiment the features and/or the actions described and/or depicted herein can occur on or with respect to the blockchain 852.

FIG. 9 illustrates an example system 900 that supports one or more of the example embodiments described and/or depicted herein. The system 900 comprises a computer system/server 902, which is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with computer system/server 902 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above systems or devices, and the like.

Computer system/server 902 may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types. Computer system/server 902 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.

As shown in FIG. 9, computer system/server 902 in cloud computing node 900 is shown in the form of a general-purpose computing device. The components of computer system/server 902 may include, but are not limited to, one or more processors or processing units 904, a system memory 906, and a bus that couples various system components including system memory 906 to processor 904.

The bus represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnects (PCI) bus.

Computer system/server 902 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer system/server 902, and it includes both volatile and non-volatile media, removable and non-removable media. System memory 906, in one embodiment, implements the flow diagrams of the other figures. The system memory 906 can include computer system readable media in the form of volatile memory, such as random-access memory (RAM) 910 and/or cache memory 912. Computer system/server 902 may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system 914 can be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”). Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media can be provided. In such instances, each can be connected to the bus by one or more data media interfaces. As will be further depicted and described below, memory 906 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of various embodiments of the application.

Program/utility 916, having a set (at least one) of program modules 918, may be stored in memory 906 by way of example, and not limitation, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating system, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment. Program modules 918 generally carry out the functions and/or methodologies of various embodiments of the application as described herein.

As will be appreciated by one skilled in the art, aspects of the present application may be embodied as a system, method, or computer program product. Accordingly, aspects of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present application may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Computer system/server 902 may also communicate with one or more external devices 920 such as a keyboard, a pointing device, a display 922, etc.; one or more devices that enable a user to interact with computer system/server 902; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 902 to communicate with one or more other computing devices. Such communication can occur via I/O interfaces 924. Still yet, computer system/server 902 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 926. As depicted, network adapter 926 communicates with the other components of computer system/server 902 via a bus. It should be understood that although not shown, other hardware and/or software components could be used in conjunction with computer system/server 902. Examples, include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.

Although an exemplary embodiment of at least one of a system, method, and non-transitory computer readable medium has been illustrated in the accompanied drawings and described in the foregoing detailed description, it will be understood that the application is not limited to the embodiments disclosed, but is capable of numerous rearrangements, modifications, and substitutions as set forth and defined by the following claims. For example, the capabilities of the system of the various figures can be performed by one or more of the modules or components described herein or in a distributed architecture and may include a transmitter, receiver or pair of both. For example, all or part of the functionality performed by the individual modules, may be performed by one or more of these modules. Further, the functionality described herein may be performed at various times and in relation to various events, internal or external to the modules or components. Also, the information sent between various modules can be sent between the modules via at least one of: a data network, the Internet, a voice network, an Internet Protocol network, a wireless device, a wired device and/or via plurality of protocols. Also, the messages sent or received by any of the modules may be sent or received directly and/or via one or more of the other modules.

One skilled in the art will appreciate that a “system” could be embodied as a personal computer, a server, a console, a personal digital assistant (PDA), a cell phone, a tablet computing device, a smartphone or any other suitable computing device, or combination of devices. Presenting the above-described functions as being performed by a “system” is not intended to limit the scope of the present application in any way but is intended to provide one example of many embodiments. Indeed, methods, systems and apparatuses disclosed herein may be implemented in localized and distributed forms consistent with computing technology.

It should be noted that some of the system features described in this specification have been presented as modules, in order to more particularly emphasize their implementation independence. For example, a module may be implemented as a hardware circuit comprising custom very large-scale integration (VLSI) circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices, graphics processing units, or the like.

A module may also be at least partially implemented in software for execution by various types of processors. An identified unit of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions that may, for instance, be organized as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together but may comprise disparate instructions stored in different locations which, when joined logically together, comprise the module and achieve the stated purpose for the module. Further, modules may be stored on a computer-readable medium, which may be, for instance, a hard disk drive, flash device, random access memory (RAM), tape, or any other such medium used to store data.

Indeed, a module of executable code could be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Similarly, operational data may be identified and illustrated herein within modules and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.

It will be readily understood that the components of the application, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the detailed description of the embodiments is not intended to limit the scope of the application as claimed but is merely representative of selected embodiments of the application.

One having ordinary skill in the art will readily understand that the above may be practiced with steps in a different order, and/or with hardware elements in configurations that are different than those which are disclosed. Therefore, although the application has been described based upon these preferred embodiments, it would be apparent to those of skill in the art that certain modifications, variations, and alternative constructions would be apparent.

While preferred embodiments of the present application have been described, it is to be understood that the embodiments described are illustrative only and the scope of the application is to be defined solely by the appended claims when considered with a full range of equivalents and modifications (e.g., protocols, hardware devices, software platforms etc.) thereto. 

What is claimed is:
 1. A system, comprising: an executing client, configured to: generate a blockchain transaction comprising an anonymous rating related to an authorizing client and a root node value; a blockchain network, comprising: a shared ledger, comprising: a lookback key; and a merkle tree that corresponds to a supplier, the merkle tree comprising a merkle tree root node value stored in the lookback key; and a byte-wise prefix search tree of a fixed depth, configured to store valid historical values for the lookback key; and a smart contract, configured to: receive the blockchain transaction; add the anonymous rating to the shared ledger.
 2. The system of claim 1, wherein the smart contract is further configured to: define a particular key to be the lookback key, wherein the lookback key comprising a fixed length value in bytes; initialize a byte-wise prefix search tree stored in the shared ledger to the value of the lookback key after it is defined; and update the byte-wise prefix search tree with a new value of the corresponding lookback key written by the smart contract.
 3. The system of claim 2, wherein the smart contract comprises a valid historical value assert call and is further configured to: verify the root node value using the valid historical value assert call on the lookback key storing the merkle tree root node value; execute a search for a value on the byte-wise prefix search tree, in response to the valid historical value assert call; determine the byte-wise prefix search tree comprising the new value, and in response: indicate success for the valid historical value assert call; and determine the byte-wise prefix search tree not comprising the new value, and in response: exit the smart contract execution with a failure, wherein a number of steps of the search and update operations being at most the fixed depth of the byte-wise prefix search tree, wherein the fixed depth of the prefix search tree comprises the fixed length value of the lookback key.
 4. The system of claim 3, wherein the blockchain transaction comprises the proof and a nullifier, wherein the proof provides an indication that the executing client possesses the random secret and the nullifier corresponds to a new leaf node of the merkle tree, wherein the anonymous rating is not linked to an identity of the executing client, wherein the authorizing client is unable to determine the executing client identity, wherein the smart contract is further configured to: verify the proof with the root node value and the nullifier; in response to the smart contract adds the anonymous rating to the shared ledger, the smart contract is further configured to: mark the nullifier as used; and store the marked nullifier to the shared ledger.
 5. The system of claim 4, wherein the blockchain transaction comprises a signed transaction, wherein the smart contract is further configured to: verify the signature without revealing the executing client identity.
 6. The system of claim 3, wherein the nullifier corresponds to an undisclosed leaf node in the merkle tree, wherein the proof comprises a zero-knowledge proof that does not identify a merkle tree leaf node to use to verify the proof, wherein the smart contract is further configured to: verify the nullifier has not been previously used; and verify the root node value is one of a current or a previous merkle tree root node value.
 7. The system of claim 3, wherein the smart contract is further configured to: verify that the root node value is one of the current or a previous merkle tree root node values; and in response to verifying that the root node value is one of the current or the previous merkle tree root node values, the smart contract is further configured to: add the anonymous rating to the shared ledger; and in response to not verifying that the root node value is one of the current or the previous merkle tree root node values, the smart contract is further configured to: exit smart contract execution with a failure.
 8. A method, comprising: receiving, from an executing client, a blockchain transaction comprising an anonymous rating related to an authorizing client, a merkle tree root node value, a proof, and a nullifier, and in response: executing, by a smart contract, a valid historical value assert call on a lookback key storing the merkle tree root node value; verifying, through a valid historical value assert call, that the merkle tree root node value is a current or previous value of the merkle tree root node value; verifying the proof with the merkle tree root node value and the nullifier; adding the anonymous rating to a shared ledger; marking the nullifier as used; and storing the marked nullifier to the shared ledger.
 9. The method of claim 8, further comprising: defining, by the smart contract, a particular key to be the lookback key, wherein the lookback key comprising a fixed length value in bytes; initializing a byte-wise prefix search tree stored in the shared ledger to the value of the lookback key after it is defined; and updating the byte-wise prefix search tree by adding a new value of the corresponding lookback key written by the smart contract.
 10. The method of claim 9, further comprising: receiving, from the smart contract, the valid historical value assert call; executing a search for a value on the byte-wise prefix search tree; in response to determining the byte-wise prefix search tree comprising the value: indicating success for the valid historical value assert call; and in response to determining the byte-wise prefix search tree not comprising the value: exiting the smart contract execution with a failure, wherein a number of steps of the search and update operations being at most the fixed depth of the byte-wise prefix search tree, wherein the fixed depth of the prefix search tree comprising the fixed length value of the lookback key.
 11. The method of claim 10, wherein the proof providing an indication that the executing client possesses the random secret and the nullifier corresponds to a new leaf node of the merkle tree, wherein the anonymous rating is not linked to an identity of the executing client, wherein the authorizing client is unable to determine the executing client identity.
 12. The method of claim 11, wherein the blockchain transaction comprising a signed transaction, wherein the method further comprising: verifying, by the smart contract, the signature without revealing the executing client identity.
 13. The method of claim 10, wherein the nullifier corresponding to an undisclosed leaf node in the merkle tree, wherein the proof comprising a zero-knowledge proof that does not identify a merkle tree leaf node to use to verify the proof, wherein the method further comprising: verifying, by the smart contract, the nullifier has not been previously used; and verifying the root node value is one of a current or a previous merkle tree root node value.
 14. The method of claim 10, wherein verifying the root node value is one of the current or the previous merkle tree root node value comprising: calling, by the smart contract, a query on the current and previous values of the key that stores the merkle tree root node value; and in response to verifying the root node value is one of the current or the previous merkle tree root node value, the method further comprising: adding, by the smart contract, the anonymous rating to the shared ledger; and in response to not verifying the root node value is one of the current or the previous merkle tree root node value, the method further comprising: exiting smart contract execution with a failure.
 15. A non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform: receiving, from an executing client, a blockchain transaction comprising an anonymous rating related to an authorizing client, a merkle tree root node value, a proof, and a nullifier, and in response: executing, by a smart contract, a valid historical value assert call on a lookback key storing the merkle tree root node value; verifying, through a valid historical value assert call, that the merkle tree root node value is a current or previous value of the merkle tree root node value; verifying the proof with the merkle tree root node value and the nullifier; adding the anonymous rating to a shared ledger; marking the nullifier as used; and storing the marked nullifier to the shared ledger.
 16. The non-transitory computer readable medium of claim 15, wherein the instructions further cause the processor to perform: defining, by the smart contract, a particular key to be the lookback key, wherein the lookback key comprising a fixed length value in bytes; initializing a byte-wise prefix search tree stored in the shared ledger to the value of the lookback key after it is defined; and updating the byte-wise prefix search tree by adding a new value of the corresponding lookback key written by the smart contract.
 17. The non-transitory computer readable medium of claim 16, wherein the instructions cause the processor to further perform: receiving, from the smart contract, the valid historical value assert call; executing a search for a value on the byte-wise prefix search tree; in response to determining the byte-wise prefix search tree comprising the value: indicating success for the valid historical value assert call; and in response to determining the byte-wise prefix search tree not comprising the value: exiting the smart contract execution with a failure, wherein a number of steps of the search and update operations being at most the fixed depth of the byte-wise prefix search tree, wherein the fixed depth of the prefix search tree comprising the fixed length value of the lookback key.
 18. The non-transitory computer readable medium of claim 17, wherein the proof providing an indication that the executing client possesses the random secret and the nullifier corresponds to a new leaf node of the merkle tree, wherein the anonymous rating is not linked to an identity of the executing client, wherein the authorizing client is unable to determine the executing client identity.
 19. The non-transitory computer readable medium of claim 17, wherein the nullifier corresponding to an undisclosed leaf node in the merkle tree, wherein the proof comprising a zero-knowledge proof that does not identify a merkle tree leaf node to use to verify the proof, wherein the instructions cause the processor to further perform: verifying, by the smart contract, the nullifier has not been previously used; and verifying the root node value is one of a current or a previous merkle tree root node value.
 20. The non-transitory computer readable medium of claim 17, wherein verifying the root node value is one of the current or the previous merkle tree root node value comprising: calling, by the smart contract, a query on the current and previous values of the key that stores the merkle tree root node value; and in response to verifying the root node value is one of the current or the previous merkle tree root node value: adding, by the smart contract, the anonymous rating to the shared ledger; and in response to not verifying the root node value is one of the current or the previous merkle tree root node value: exiting smart contract execution with a failure. 